Spectral Clustering Wikipedia Keyword-Based Search Results
نویسندگان
چکیده
منابع مشابه
Spectral Clustering Wikipedia Keyword-Based Search Results
The paper summarizes our research in the area of unsupervised categorization of Wikipedia articles. As a practical result of our research, we present an application of spectral clustering algorithm used for grouping Wikipedia search results. The main contribution of the paper is a representation method for Wikipedia articles that has been based on combination of words and links and used for cat...
متن کاملWikipedia Based Approach for Clustering Keyword of Reviews
A novel method based on Wikipedia for clustering keyword of reviews is proposed. Users can quickly finding the themes they interest through it. First the method extracts keywords, then calculates word similarity based on Wikipedia to generate similarity matrix, finally uses k-means to cluster. The performance is better than the methods which based on How-net and Word-net. The accuracy is around...
متن کاملResults Clustering for Keyword Search over Relational Database
Keyword Search over Relational Database (KSORD) has been a hot research topic in the field of the database. The existing prototype systems present the results to user in a linear list. The user has to browse individually. Therefore, it is still very difficult to find the information users really need. To solve this problem, this study is carried out on results clustering for Keyword Search over...
متن کاملSelf-Organizing Map Representation for Clustering Wikipedia Search Results
The article presents an approach to automated organization of textual data. The experiments have been performed on selected sub-set of Wikipedia. The Vector Space Model representation based on terms has been used to build groups of similar articles extracted from Kohonen Self-Organizing Maps with DBSCAN clustering. To warrant efficiency of the data processing, we performed linear dimensionality...
متن کاملGraph Clustering for Keyword Search
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. However, there are applications where the graph can be much larger than the available memory. This led to the development of search algorithms which search on a smaller memory resident summary graph (supernode graph), ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Robotics and AI
سال: 2017
ISSN: 2296-9144
DOI: 10.3389/frobt.2016.00078